A Method and Apparatus for Data Mediation

ABSTRACT

The teachings herein disclose a method and apparatus for data mediation in a telecommunication network provides advantageous processing of an incoming data stream in a matter that reduces the amount of decoding needed for processing and correspondingly reduces the amount of re-encoding needed for transport of the processed data stream. These teachings make use of a working data structure that provides a memory-efficient data structure for processing targeted data items in the data stream and are implemented, for example, in a data mediation node that includes one or more communication interfaces, e.g., for receiving incoming data streams for data-mediation processing, and for sending along processed data streams to targeted recipients.

TECHNICAL FIELD

The present invention generally relates to telecommunication networks,and particularly relates to data mediation in a telecommunicationnetwork.

BACKGROUND

Almost every facet of operations in telecommunication networks and othercomplex processing systems involves the collection, processing andtransport of data. Oftentimes, for reasons of bandwidth, security, etc.,data is encoded or otherwise encapsulated for transport betweennetworked nodes. Consequently, a significant computational burden arisesin such systems, driven by repeated, ongoing need for generating,processing, coding and decoding data.

The burden is especially acute in certain example contexts, such as inthe area of “data mediation” within a mediation system in atelecommunication network. Network data is the enabling ingredient forall revenue assurance operations for any network operator, and it mustbe complete and correct for the network operator to enforce policies,generate charging and billing information, and to undertake any among abroad range of other actions, such as market analyses, serviceassurance, network planning, etc.

In the telecommunication network context, a mediation system collects,formats and distributes data within the network, for use in range ofactivities, including charging and billing, fraud detection andstatistical analyses. The typical mediation system interfaces withvarious types of nodes, including access and core network nodes, e.g.,for securing Charging Data Records, CDRs, associated with chargeabletelecommunication events occurring within the network. Correspondingly,the mediation system provides such data, or aggregated or modifiedcollections of such data, to various Operations Support System, OSS,servers. OSS servers perform “back-office” activities, such asmaintenance and provisioning support for communication services. Thesame or other mediated data is also provided to various Business SupportSystems, BSS, servers. BSS servers generally provide subscriber-facingservices, such as billing and order management functions.

In a particular example, the mediation system collects data from various“south bound” interfaces that face the core and/or access networks. Themediation system applies various processing to the collected data, suchas consolidation, co-relation or correlation, enrichment, etc., and theprocessed data is sent out on one or more “north bound” interfaces thatface various BSS and OSS servers.

In many of the scenarios, the data incoming to the mediation system isencoded in TLV format where TLV exists for Type, Length and Value.Protocols such as ASN.1, Diameter, Radius, Mobile ad hoc Network, MANET,etc., all support data that are represented in the TLV format.TLV-encoded data requires decoding before processing. TLV decodingprovides an object-based representation for easier manipulation to the“users” of that data. Here, the term “users” has a specialized meaning,as it denotes a process or function that takes in certain data forprocessing. Frequently, after such processing, the resulting data mustbe re-encoded according to the applicable specifications, for deliveryto a further node or user, e.g., for further manipulation or archiving.

Often the involved data records involve a multiplicity of individualdata fields or items. See, for example, the following two documentswhich provide relevant specifications for the representation of CDRs innetworks based on the following Third Generation Partnership Project,3GPP, specifications: 3GPP TS 32.297: Charging Data Record (CDR) fileformat and transfer, v12.2.0; and 3GPP TS 32.298: Charging Data Record(CDR) parameter description. Significant computational loading andprocessing time is consumed in association with receiving complex,encoded data structures, decoding them, processing selected data itemsfrom among the decoded data, and then re-encoding the data for transportto a further node or process.

It is thought that the typical mediation system may spend as much asforty to fifty percent of its time performing data decoding andencoding, and there have been attempts to address at least certainaspects of that processing overhead. See, for example, U.S. Pat. No.8,819,135 to Karlsson, which uses a form of selective parsing to improveefficiencies when processing data streams incoming from a datacommunication network. U.S. Pat. No. 8,526,618 to Little providesanother known example of processing encoded messages at a receiver. And,in a slightly different context, one might usefully refer to the widelyavailable references for the XML-document parsing algorithm known as“SAX” or “Simple API for XML”.

SUMMARY

The teachings herein disclose a method and apparatus for data mediationin a telecommunication network and provide advantageous processing of anincoming data stream in a matter that reduces the amount of decodingneeded for processing and correspondingly reduces the amount ofre-encoding needed for transport of the processed data stream. Theseteachings make use of a working data structure that provides amemory-efficient data structure for processing targeted data items inthe data stream and are implemented. These teachings are implemented,for example, in a data mediation node that includes one or morecommunication interfaces, e.g., for receiving incoming data streams fordata-mediation processing, and for sending along processed data streamsto targeted recipients.

An example method of processing at a mediation node configured for datamediation operations in a telecommunication network includes receivingan incoming data stream. The incoming data stream comprises encoded dataitems encoded according to a first encoding and is arranged according toa defined hierarchical structure. The method further includes storingthe incoming data stream as a stored data stream, where the incomingdata stream is stored initially without decoding at a root node of aworking data structure that defines further nodes corresponding to theplurality of data items encoded in the stored data stream. The methodfurther includes identifying a targeted data item in the stored datastream—i.e., a data item that is targeted for data mediation processing.Still further, the method includes extracting the targeted data itembased on traversing the defined hierarchical structure of the storeddata stream along a traversal path until reaching the targeted dataitem.

For each intervening data item encountered along the traversal pathbefore reaching the targeted data item, the method includes moving,without decoding, the intervening data item from the root node to acorresponding further node in the working data structure. For thetargeted data item, the method includes decoding the targeted data itemand populating a corresponding further node in the working datastructure with the decoded targeted data item. The method additionallyincludes providing the working data structure for processing of thedecoded targeted data item, e.g., for processing according to theoperations defined in a given workflow.

An example mediation node according to an embodiment disclosed herein isconfigured for data mediation operations in a telecommunication networkand it includes a communication interface and a processing circuitoperatively associated with the communication interface. Thecommunication interface is configured to receive an incoming data streamcomprising encoded data items encoded according to a first encoding andarranged according to a defined hierarchical structure. Correspondingly,the processing circuit is configured to store the incoming data streamas a stored data stream, where the stored data stream is stored withoutdecoding at a root node of a working data structure that defines furthernodes corresponding to a plurality of data items encoded in the storeddata stream.

The processing circuit is further configured to identify a targeted dataitem in the stored data stream and extract the targeted data item, basedon being configured to traverse the defined hierarchical structure ofthe stored data stream along a traversal path until reaching thetargeted data item. For each intervening data item encountered along thetraversal path before reaching the targeted data item, the processingcircuit is configured to move, without decoding, the intervening dataitem from the root node to a corresponding further node in the workingdata structure. For the targeted data item, the processing circuit isconfigured to decode the targeted data item and populate a correspondingfurther node in the working data structure with the decoded targeteddata item, and further to provide the working data structure forprocessing of the decoded targeted data item. For example, it passes theworking data structure along to a given “processing job” or otherfunction, or it makes the working data structure available for suchprocessing.

In yet another embodiment, a mediation node is configured for datamediation operations in a telecommunication network and comprises meansadapted to receive an incoming data stream comprising encoded data itemsencoded according to a first encoding and arranged according to adefined hierarchical structure. The mediation node further comprisesmeans adapted to store the incoming data stream as a stored data stream,where the stored data stream is stored without decoding at a root nodeof a working data structure that defines further nodes corresponding toa plurality of data items encoded in the stored data stream.

The mediation node further includes means adapted to identify a targeteddata item in the stored data stream, targeted for data mediationprocessing and to extract the targeted data item based on traversing thedefined hierarchical structure of the stored data stream along atraversal path until reaching the targeted data item. For eachintervening data item encountered along the traversal path beforereaching the targeted data item, the mediation node is adapted to move,without decoding, the intervening data item from the root node to acorresponding further node in the working data structure. For thetargeted data item, the mediation node is adapted to decode the targeteddata item, populate a corresponding further node in the working datastructure with the decoded targeted data item, and to provide theworking data structure for processing of the decoded targeted data item.

In another example implementation, such as may be realized in digitalprocessing circuitry, the mediation node includes a first moduleconfigured to receive an incoming data stream comprising encoded dataitems encoded according to a first encoding and arranged according to adefined hierarchical structure. The mediation node further includes asecond module configured to store the incoming data stream as a storeddata stream. Here, the stored data stream is stored without decoding ata root node of a working data structure that defines further nodescorresponding to a plurality of data items encoded in the stored datastream. The mediation node includes a third module configured toidentify a targeted data item in the stored data stream, which data itemis targeted for data mediation processing.

Correspondingly, the mediation node includes a fourth module configuredto extract the targeted data item based on traversing the definedhierarchical structure of the stored data stream along a traversal pathuntil reaching the targeted data item. For each intervening data itemencountered along the traversal path before reaching the targeted dataitem, the fourth module is configured to move, without decoding, theintervening data item from the root node to a corresponding further nodein the working data structure. For the targeted data item, the fourthmodule is configured to decode the targeted data item and populate acorresponding further node in the working data structure with thedecoded targeted data item. Still further, the mediation node includes afifth module configured to provide the working data structure forprocessing of the decoded targeted data item.

Of course, the present invention is not limited to the above featuresand advantages. Indeed, those skilled in the art will recognizeadditional features and advantages upon reading the following detaileddescription, and upon viewing the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of one embodiment of a mediation node, shownin context with an example telecommunication network.

FIG. 2 is logic flow diagram of one embodiment of a method of datamediation.

FIG. 3 is a block diagram of one embodiment of processing circuits ormodules implemented in a mediation node.

FIG. 4 is a data flow diagram of one embodiment of a processing flowimplemented in a mediation node with respect to incoming data streamprocessing.

FIG. 5 is a diagram of a data structure associated withType-Length-Value, TLV, encoding, which is known for certain dataencoding operations in telecommunication networks.

FIG. 6 is a diagram of an example traversal path, such as would be usedin one or more embodiments taught herein, for processing an exampleincoming data stream that is TLV-encoded.

FIG. 7 is an example representation of an incoming data stream, which isstructured as an encoded byte stream having a number of data items orfields, and having a hierarchical data structure or arrangement forthose data items or fields.

FIG. 8 is a diagram of one embodiment of a working data structure, whichcontains nodes and corresponding node data according to the incomingdata stream of FIG. 7.

DETAILED DESCRIPTION

FIG. 1 illustrates a telecommunication network 8 that includes or isassociated with a data mediation node 10 that is depicted according toan example embodiment. By way of example, the telecommunication network8—hereafter, “network 8”—includes an Internet Protocol, IP, MultimediaSubsystem or IMS 12, a circuit-switched core network 14, an EvolvedPacket Core or “EPC” network 16, and one or more Radio Access Networksor RANs 18. In one or more examples, the RAN or RANs 18 include anEvolved Universal Terrestrial Radio Access Network or E-UTRAN, forproviding wireless communication links to various subscriber devices,such as “user equipments” or UEs.

The example network 8 also includes one or more Business SupportSystems, BSS, servers 20, and one or more Operations Support Systems,OSS, servers 22. Correspondingly, the data mediation node 10 can beunderstood as occupying a mediation role, in which it receives networkdata from any one or more of the IMS 12, the core network 14, the EPC16, and the RAN(s) 18, performs one or more mediation operations on thatdata, and passes along the resulting processed data to the BSS servers20 and/or the OSS servers 22. Here, the term “network data” refers toCharging Data Records, CDRs, and/or other billing, operations, andmanagement data underlying the provisioning and providing ofcommunication services to subscribers of the network 8. More broadly,the data mediation node 10 collects, formats and distributes networkdata of essentially any type or types, for one or more purposes. Examplepurposes include charging and billing, fraud detection, performanceanalysis, network planning, or other statistical analyses.

The illustrated embodiment of the data mediation node 10—hereafter,“mediation node 10”—includes a communication interface 30 that isconfigured to receive an incoming data stream comprising encoded dataitems encoded according to a first encoding and arranged according to adefined hierarchical structure. Further, the mediation node 10 includesa processing circuit 32 that is operatively associated with thecommunication interface 30. The processing circuit 32 further includesor is associated with storage 34, which in one or more embodimentsstores a computer program 36 and certain configuration data 38.

In at least some embodiments, the processing circuit 32 comprisesprocessing circuitry—e.g., a microprocessor, DSP, FPGA, ASIC, etc.—thatis configured to carry out the processing operations taught herein,based at least in part on execution by the processing circuit 32 of thecomputer program instructions comprising the computer program 36. Suchprocessing may be further controlled or may otherwise be informed by theconfiguration data 38, where such data may include so called “workflow”instructions. As will be explained later, a workflow is a defined taskor set of tasks to be performed with respect to particular incoming dataor with respect to particular types of incoming data.

The storage 34 comprises one or more types of computer readable media,and may comprise volatile storage, such as SRAM and/or DRAM.Additionally, or alternatively, the storage 34 comprises non-volatilestorage, such as FLASH, EEPROM, Solid State Disk, etc. In any case, thestorage 34 provides non-transitory storage for the computer program 36,in embodiments that use the computer program 36. Here, the term“non-transitory storage” does not necessarily mean permanent storage,but does mean “persistent” storage of at least some duration. As such,the term excludes “storage” of information in a mere propagating signal.

Whether it comprises programmed circuitry or fixed circuitry, or somecombination of programmed and fixed circuitry, the processing circuit 32is configured to store the incoming data stream as a stored data stream.In particular, the incoming data stream is stored initially withoutdecoding at a root node of a working data structure 40 that definesfurther nodes 122 corresponding to a plurality of data items encoded inthe stored data stream. The working data structure 40 may be generatedand held in a working memory of the processing circuit 32, as part ofrun-time processing performed with respect to the incoming data stream.

In the non-limiting example embodiment, the mediation node 10 includes auser interface 42. For example, the user interface 42 comprises akeyboard and display or other input/output devices or circuitry, orcomprises a network interface to another computer system withinput/output devices. In any case, the user interface 42 is anon-limiting example of a mechanism by which workflow definitions may becreated, deleted, modified, and saved, for use by the mediation node 10.Here, a “workflow” is a task definition and it specifies certainprocessing to be performed to certain data items, and may include a hostof processing directives to be followed by the mediation node 10 forcertain types of data streams incoming to it.

With respect to the example data stream being discussed and its storeddata stream counterpart, the processing circuit 32 is configured toidentify a targeted data item in the stored data stream, targeted fordata mediation processing, and to extract the targeted data item basedon being configured to perform a number of operations or actions thatobtain the targeted data item in decoded form. These operations avoidunnecessary decoding and provide advantageous memory management. As willbe further explained, such processing “prep-populates” correspondingnodes in the working data structure 40 with encoded data items movedfrom the root node during extraction of the targeted data items. Thepre-populating aids, for example, any further processing of the samedata stream that targets any of the prepopulated data items.

In more detail, in an example embodiment, the processing circuit 32 isconfigured to extract a targeted data item from the stored data streamheld in the root node, based on being configured to traverse the definedhierarchical structure of the stored data stream along a traversal pathuntil reaching the targeted data item. For each intervening data itemencountered along the traversal path before reaching the targeted dataitem, the processing circuit 32 is configured to move, without decoding,the intervening data item from the root node to a corresponding furthernode in the working data structure 40. Further, for the targeted dataitem, the processing circuit 32 is configured to decode the targeteddata item and populate a corresponding further node in the working datastructure 40 with the decoded targeted data item. Still further, theprocessing circuit 32 is configured to provide the working datastructure 40 for processing of the decoded targeted data item.

In the context above, it will be appreciated that “further nodes” of theworking data structure 40 correspond to respective data items in thestored data stream, and that the working data structure 40 has a treestructure or other arrangement that reflects the hierarchy orrelationship between data items in the stored data stream. Of course,the working data structure 40 may not be built out completely, andinstead the processing circuit 32 may instantiate only that amount orthose branches and nodes of the working data structure 40 that arenecessary to hold the targeted data items in decoded form, and to holdthe intervening data items in encoded form. To the extent that more thanone data item is targeted, it will be appreciated that the working datastructure 40 will be built out with the further nodes corresponding toeach traversal path—i.e., the hierarchical data structure path thatleads to each targeted data item.

It is worth emphasizing here that only the targeted data items aredecoded. That is, a targeted data item is moved from the root node,decoded, and stored in decoded form in its corresponding further node ofthe working data structure 40. The intervening data items are also movedfrom the root node and stored in corresponding further nodes of theworking data structure 40, but they are not decoded. “Moving” a dataitem from the root node to its corresponding further node includesreleasing or repurposing the root node memory allocated for that dataitem. For example, the involved root node memory can be logicallyredefined as the corresponding further node, e.g., using pointers orother data-structure management value, or the involved root node memorycan be released back into a memory pool, and a new memory allocation canbe made for the corresponding further node. In any case, it will beappreciated that moving data items from the root node to correspondingfurther nodes is done in a memory-efficient manner.

Consider a working example where the configuration data 38 includes aworkflow definition that identifies one or more processing actions to beperformed on incoming data streams of a defined type, and assume thatsuch an incoming data stream is received at the mediation node 10. Theprocessing circuit 32 stores the incoming data stream in encoded form,in a root node of a working data structure 40. The processing circuit 32identifies one or more data items in the stored data stream that aretargeted for processing. For each targeted data item, the processingcircuit 32 traverses the hierarchical structure defined in the storeddata stream—e.g., a tree structure or other parent/child objectstructure—until it reaches the targeted data item. The processingcircuit 32 extracts the targeted data item, decodes it, and moves it toa corresponding node in the working data structure 40. Further, for eachdata item encountered by the processing circuit 32 on the traversal pathleading to the targeted data item, where such items are referred to asintervening data items, the processing circuit 32 moves the interveningdata item to a corresponding node in the working data structure 40,without decoding it.

The end result of such processing is that the root node of the workingdata structure 40 holds any remaining data items—i.e., data items notmoved from the root node as being an intervening or targeted data item.The remaining data items are still in their encoded form and theirhierarchical relationship within the stored data stream is preserved.The root node however no longer holds any data item from the stored datastream that were identified as a targeted data item, or encountered asan intervening data item. More particularly, each targeted data item ismoved to a corresponding further node in the working data structure 40and stored there in decoded form, and each intervening data item ismoved to a corresponding further node in the working data structure 40and stored there in encoded form. Because these further nodes of theworking data structure 40 embody or are otherwise logically inter-linkedaccording to the defined hierarchical data structure of the originalincoming data stream, the hierarchical relationships between remainingdata items, targeted data items, and intervening data items ispreserved. This preservation of hierarchical data relationships is keyto re-encoding an outgoing data stream after processing the targeteddata items.

Thus, after receiving a given incoming data stream for processing, theprocessing circuit 32 builds out a working data structure 40 accordingto the above teachings. In so doing, the processing circuit 32identifies the targeted data item or items and builds out the workingdata structure 40 accordingly. The resulting working data structure 40,including its one or more targeted data items held in decoded form, isprovided for processing in accordance with one or more workflowdefinition. Such processing may be carried out by the processing circuit32, or by other circuitry in the mediation node 10.

The workflow processing results in the modification of the targeted dataitems, or in the creation of new data items, and the working datastructure 40 can be updated to reflect the results of such processing,or a new working data structure 40 can be created. Here, it may be notedthat more than one workflow, or a least more than one processingoperation, can be applied to any given working data structure 40.Moreover, such processing can use any resulting, new working datastructures 40. Because each further processing operation may involve oneor more of the data items already involved in prior processing—i.e.,data items that were either targeted or traversed in the priorprocessing—the particular data items involved in the further processingmay already have been moved from the root node to their correspondingnodes in the working data structure, thus avoiding the need to performthose actions again and thereby increasing the efficiency of the furtherprocessing.

It will also be appreciated that once all processing has been performedon a given working data structure 40, the data contained therein can be“re-packaged” according to any standard or protocol associated with thetransport of the involved data type(s). For example, take the case wherean incoming data stream comprises a CDR. After building out a workingdata structure 40 for the CDR according to the above teachings, andafter finishing the processing operation or operations defined forprocessing the CDR, the data items held in the working data structure 40can be re-encoded as a new or modified CDR that includes any new ormodified data obtained via the applied processing. The newly encoded CDRcan then be sent to a targeted recipient using the same protocols usedfor any other CDR exchanged within or by the mediation node 8. In thisregard, a “targeted recipient” may be another computational process,function, or workflow being carried out within the mediation node 10, orthe targeted recipient may be external to the mediation node 10, e.g.,one of the BSS application servers 20 or one of the OSS applicationservers 22.

Thus, with respect to a given working data structure 40 that includesone or more decoded targeted data items, and assuming that all desiredprocessing has been completed for the given working data structure 40,at least for a given workflow, the processing circuit 32 is configuredto form an outgoing data stream. The processing circuit 32 forms theoutgoing data stream based on being configured to re-encode the decodedtargeted data item(s) after said processing or a corresponding deriveddata item generated by said processing, as a newly-encoded data item.The processing circuit 32 is further configured to aggregate thenewly-encoded data item with the intervening data items previously movedto the corresponding further nodes in the working data structure 40,along with any remaining data items not moved from the root node, and toprovide the outgoing data stream to a targeted recipient.

As a general proposition, for any given incoming data stream orcorresponding stored data stream, the processing circuit 32 isconfigured to identify a targeted data item by accessing stored workflowinformation for a defined processing workflow, wherein the definedprocessing workflow indicates the targeted data item. The definedprocessing workflow may identify any number of data items as “targeteddata items” and the processing circuit 32 is configured to extract eachtargeted data item and perform the previously-described operations ofmoving and populating for each targeted data item, in accordance withthe traversal path to each targeted data item.

In at least some embodiments, the incoming data streams comprise bytestreams encoded using Type-Length-Value, TLV, encoding. TLV encodingdefines the hierarchical structure of the byte streams as a treestructure. Correspondingly, the traversal path to a given data item inan TLV-encoded byte stream extends through as many levels of the treestructure as are needed to reach the targeted data item.

More generally, in cases where the defined hierarchical structure of anincoming data stream comprises a tree structure, the processing circuit32 in one or more embodiments is configured to traverse the definedhierarchical tree structure beginning at a base level of the treestructure and progressing via a breadth-first traversal to as many nextlevels of the tree structure as are needed to reach a targeted dataitem. Consequently, the breadth-first traversal at each level of thetree structure begins with a first data item at that level and advancesthrough each next data item at that level until encountering thetargeted data item, in which case the traversal ends, or untilencountering a container data item that is on the traversal path, inwhich case the traversal advances to the first contained data item atthe next level of the tree structure and the breadth-first traversalrestarts at that next level. Here, it will be appreciated that a“container data item” contains one or more distinct data items, e.g.,“child” data objects, and in fact may contain other container dataitems.

The contemplated traversal technique can be understood as drilling downalong the most direct or shortest traversal path permitted by theencoding hierarchy of the incoming data stream. As noted, the incomingdata stream may be a CDR comprising a plurality of data items associatedwith a chargeable event in the network 8. In a particular example, thefirst encoding applied to the incoming CDR comprises Abstract SyntaxNotation One, ASN.1, encoding using, e.g., Basic Encoding Rules or BER.

FIG. 2 illustrates an example method 200 of processing at a mediationnode 10 configured for data mediation operations in a telecommunicationnetwork 8. One or more of the method steps may be performed in an orderother than that suggested by the example logic flow diagram. Further,all or part of the method 200 may be repeated for processing a givenincoming data stream according to multiple desired processingoperations, and the method 200 may be repeated for each in a number ofincoming data streams and/or carried out in parallel with respect todifferent incoming data streams. Moreover, it will be understood thatthe method 200 may be performed in concert with or as part of otherongoing processing operations.

The method 200 comprises receiving (Block 202) an incoming data streamcomprising encoded data items encoded according to a first encoding andarranged according to a defined hierarchical structure. The method 200further includes storing (Block 204) the incoming data stream as astored data stream, the stored data stream being stored without decodingat a root node of a working data structure 40 that defines further nodescorresponding to a plurality of data items encoded in the stored datastream.

The method 200 further includes identifying (Block 206) a targeted dataitem in the stored data stream, targeted for data mediation processing.Still further, the method 200 includes extracting (Block 208) thetargeted data item.

This extraction includes traversing (Block 208A) the definedhierarchical structure of the stored data stream along a traversal pathuntil reaching the targeted data item. For each intervening data itemencountered along the traversal path before reaching the targeted dataitem, the method 200 includes moving (Block 208B), without decoding, theintervening data item from the root node to a corresponding further nodein the working data structure 40. For the targeted data item, the method200 includes decoding (Block 208C) the targeted data item and populatinga corresponding further node in the working data structure 40 with thedecoded targeted data item. Still further, the method 200 includesproviding (Block 210) the working data structure 40 for processing ofthe decoded targeted data item.

FIG. 3 depicts a functional processing module arrangement, where themediation node 10 comprises a first or receiving module 50 configured toreceive an incoming data stream. The incoming data stream comprisesencoded data items encoded according to a first encoding and arrangedaccording to a defined hierarchical structure. The mediation node 10further comprises a second or storing module 52 configured to store theincoming data stream as a stored data stream. The stored data stream isstored without decoding at a root node of a working data structure 40that defines further nodes corresponding to a plurality of data itemsencoded in the stored data stream.

According to the illustrated embodiment, the mediation node 10 includesa third or identifying module 54 configured to identify a targeted dataitem in the stored data stream, targeted for data mediation processing.Additionally, the mediation node 10 includes a fourth or extractingmodule 56 configured to extract the targeted data item. The extractionis based on traversing the defined hierarchical structure of the storeddata stream along a traversal path until reaching the targeted dataitem. For each intervening data item encountered along the traversalpath before reaching the targeted data item, the extracting module 56moves, without decoding, the intervening data item from the root node toa corresponding further node in the working data structure 40. For thetargeted data item, the extracting module 56 decodes the targeted dataitem and populates a corresponding further node in the working datastructure 40 with the decoded targeted data item. Complementing thisarrangement, the mediation node 10 further comprises a fifth orproviding module 58 configured to provide the working data structure 40for processing of the decoded targeted data item.

As seen in the diagram, such processing may be performed in accordancewith one or more workflows—shown in FIG. 3 as one or more workflows 60stored in the storage 34. Note that the working data structure 40 may beheld, at least temporarily, in working memory, such as may be done forrun-time instantiation and use of the working data structure 40.

Further, although not specifically depicted in the diagram, the storeddata stream as held in the root node of the working data structure 40can be processed multiple times, as needed, to extract more than onedata item for one workflow or for two or more workflows. Multipleworkflows or multiple processing operations can thus involved the sameworking data structure 40 and the path-traversal operations describedherein can be performed as many times as needed, for extraction of alltargeted data items, with each traversal benefitting from any pathoverlaps with prior traversals.

After completing the workflow processing, the processing results may beneeded by another process or node and the mediation node 10 includes asixth or aggregating module 60. The aggregating module 60 aggregates thedecoded targeted data items, or data items obtained therefrom, togetherwith the intervening data items that were populated into theirrespective nodes in the working data structure 40 without decoding, andtogether with the remaining data items left in encoded form in the rootnode. This aggregation will be understood as including a re-encoding ofdecoded targeted data items or the new data items obtained therefrom.The re-encoding generally will follow or otherwise preserve the datahierarchy of the incoming data stream. In that way, a given type ofincoming data stream, e.g., a given incoming byte stream, can beprocessed to form a new or modified data stream having the samestructure and format, and the new or modified data stream can then bere-encoded in form compatible with the incoming byte stream, for passingalong to a further process or node.

The targeted recipient for the processed data may be within themediation node 10, such as where one data mediation process providesresults to another data mediation process, or the targeted recipient maybe external to the mediation node 10. In either case, the processingcircuit 32 in one or more embodiments is configured to pass processeddata streams across process boundaries in a manner that is compatiblewith the encoding and exchange protocols generally applicable to thoseboundaries and to the involved data types. For example, each “userprocess” implemented by the processing circuit 32 within the mediationnode 10 may perform incoming data stream processing and provide acorresponding outgoing data stream having the same encoding and/orstructure as the incoming data stream. Here, a “user process” may bedefined as that function or collection of functions defined by a givenworkflow 60.

FIG. 4 is a data flow diagram according to one or more embodimentstaught herein, and provides a helpful illustration in the context ofdifferent user processes. One sees that an incoming byte stream issubjected to a number of processing steps or operations, as explained inthe above examples. Such processing involves an advantageous extractionof the targeted data items—the ones needed for whatever particularprocessing has been specified for a given workflow or job—and does sowithout unnecessary decoding and while maintaining a compact memoryfootprint for the stored data.

More particularly, one sees that workflow information is parsed toidentify the particular data item or items of the incoming byte streamthat are targeted—needed—for the processing operations stipulated by theworkflow information. A working data structure 40—simply “WDS” in thediagram—is instantiated in process memory, e.g., in a working memory.The WDS structure reflects the data items and the corresponding datahierarchy represented by the incoming byte stream, which is storedwithout decoding in a root node of the WDS.

The path-traversal processing is carried out, as described above. Inshort, the workflow information identifies, directly or indirectly, theparticular data items of the incoming byte stream that are needed indecoded form to carry out the processing defined by the workflow 60. Themediation node 10 extracts these targeted data items and moves them fromthe root node to their corresponding nodes in the WDS, where they areheld in decoded form for processing. The intervening data items, i.e.,those data items that are encountered on the traversal path to thetargeted data items but not needed for the workflow processing, are alsomoved from the root node to their corresponding nodes in the WDS, butthey are moved without decoding.

The “user processing” as defined by the applicable workflow 60 definingthe illustrated “User Process” is carried out. As such, the WDS may andgenerally will hold derived or modified data, as compared to theoriginal incoming data stream. To the extent that the modified versionof the data stream needs to be provided for recordkeeping or furtherprocessing, one sees that “transfer encoding” may be applied to the WDS,to form an outgoing data stream that is encoded and structured accordingto whichever protocols or standards are applicable to the contemplatedtransfer. In at least one embodiment, the WDS with its modified orprocessed data is re-encoded in a manner like that used for the originalincoming data stream, which means that the outgoing data stream iscompatible with any recipient processes or nodes that were compatiblewith the original incoming data stream.

Several of the foregoing examples assumed that the incoming data streamwas a CDR, but those examples are non-limiting. The mediation node 10may receive and process another type or other types of incoming datastreams, in addition to, or as an alternative to, the CDR type mentionedabove. In one example, the mediation node 10 receives incoming datastreams that are CDRs, and also receives incoming data streams thatcontain various performance data for the telecommunication network 8.Broadly, the mediation node in one or more embodiments collects bothcharging and performance data from different network domains, and itdistributes the data and/or derived data to multiple BSS Applicationsand Service Assurance Applications. For example, after its collection ofsuch data in its various incoming forms, the mediation node 10 performsaggregation, enrichment, and/or correlation processing of such data,before distributing the data and any processing results to downstreamapplications.

To get a better sense of how the mediation node method and apparatus atissue in the above examples perform such processing operations, considerFIG. 5, which diagrams the hierarchical data structure of exampleTLV-encoded data. The illustrated structure is typical for ASN.1 BERencoding.

Assuming, then, that the mediation node receives an incoming data streamcomprising the example TLV-encoded data shown in FIG. 5, one sees thatvarious data elements—also referred to as data items or fields—aremapped onto data objects. Again, these data objects are BER-TLV encoded.The encoding at issue in this working example is defined in the ISO/IEC8825 standard. Here, “ISO” denotes the International StandardsOrganization and “IEC” denotes the International ElectrotechnicalCommission.

Each data item is represented in TLV-encoding by three fields: a tag, alength, and a value. The “tag” defines the type of data, the “length”defines the total data length for the object, and the “value” representsthe encoded data. When the value field of a data object consists of onesingle data element, it is called a primitive data object. When thevalue field of a data object recursively encapsulates one or more otherdata objects, it is called a constructed data object. For purposes ofthis discussion, a constructed data object may also be referred to as a“container data item”, to indicate that it contains one or more otherdata objects. The data objects within one of these constructed dataobjects may also be referred to as “contained data items”.

With these rules in mind, assume that the incoming data streamrepresented by the TLV-encoded data of FIG. 5 is received at themediation node 10 and that a given workflow targets the data item 022for processing. Thus, according to the teachings herein, the mediationnode 10 will traverse the hierarchical structure of the incoming datastream, to reach the data item 022, which will be extracted andpopulated in decoded form in a corresponding node of a working datastructure 40 that embodies the hierarchical structure of the encodedincoming data stream.

FIG. 6 illustrates the traversal path at issue in this example, wherethe first hierarchical level of the structure defined by the incomingdata stream includes the data item 0, as represented by “TAG 0”, “LEN 0”and “VALUE 0”. Here, VALUE 0 is the data payload of data item 0. Thedata item 0 is a container data item, as it contains data items 01 and02, and possibly many more data items at the same hierarchical level, assuggested by the ellipses in the “NOT READ” portion of the datastructure following the data item 02. In turn, the data item 02 itselfis a container data item, as it contains data items 021 and 022, andpossibly many more data items at the same hierarchical level, assuggested by the ellipses in the “NOT READ” portion of the datastructure following the data item 022.

The working data structure 40 includes a root node that is initiallypopulated with the incoming data stream, without any “unpacking” ordecoding, and the hierarchical structure of the stored data stream istraversed using a breadth-first algorithm. Thus, the mediation node 10traverses the first hierarchical level until it finds the data item 01,which it recognizes as containing the data item 022. From the data item01, it descends down one level of the hierarchy and begins looking forthe data item 022, or for the data item containing data item 022. Thus,it traverses through the data item 01 to reach the data item 02, atwhich point it descends down one more level of the hierarchy, where ittraverses through the data item 021, to reach the targeted data item022.

It will be appreciated that the working data structure 40 has a rootnode for the overall incoming data stream, and then respective branchnodes containing the data items 01 and 02, which were encountered asintervening data items along the traversal path. The data item 01 ismoved from the root node storage and into a corresponding node in thehierarchy of the working data structure 40, but it is not decoded. Thesame thing is done for the data item 02.

Further hierarchical branch nodes are populated for the data items 021and 022, with the 021 node including the data item 021 in encoded formas another intervening data item and the 022 node including the dataitem 022 in decoded form as a targeted data item. Note that the dataitems in the “NOT READ” portions of the incoming data stream are notmoved from the root node—i.e., these remaining data items were not movedfrom the root node because they were not encountered on the traversalpath and they were not targeted for processing. Of course, the same datastream can be processed again, or processed iteratively, with respect toone or more other data items targeted for processing, and any furtherpopulations of the working data structure 40 can be performedincrementally, by adding populated nodes in the working data structure40 with any new intervening and/or targeted data items.

The above processing can be understood as a form of “just in time”decoding, where the mediation node 10 determines the path to a targeteddata item included in an incoming data stream, e.g., an incoming bytestream in TLV-encoded format. In the above example, the mediation node10 determines the traversal path to the data item 022 as “data item0→data item 01→data item 02→data item 021→data item 022”. Once thetraversal path is known, path iteration starts and includes threeactions in an example implementation.

As a first action, the mediation node 10 performs an interruptiblebreadth-first search that parses the tree structure using abreadth-first search, BFS, algorithm. The BFS algorithm is interruptedat the point where the targeted data item is encountered or where acontainer data item is encountered. Assuming that a container data itemis encountered, the BFS is continued at the next hierarchical levelinspecting the encountered data item. As a second action or operation,the mediation node 10 performs value population, where it assignsintervening data items to their corresponding nodes in the working datastructure 40, without decoding them. It populates the working datastructure 40 with the encoded data items it encounters as interveningdata items on the traversal path. As a third action, the mediation node10 performs actual decoding of the targeted data item or items, andpopulates the corresponding node or nodes in the working data structure40.

In many cases, such as where a given incoming data stream includes alarge plurality of data items, but has a relatively short traversal pathor paths to the targeted data item or items, most of the data items inthe incoming data stream are left in encoded form in the root node ofthe working data structure 40. No processing is “wasted” on theseremaining data items, and very little processing is expended on theintervening data items, which are simply moved from the root node totheir corresponding nodes in the working data structure 40. Stillfurther, the processing expended on actual decoding is reserved just forthose data items that are targeted for processing by the workflow orworkflows being handled.

FIG. 7 illustrates a sample ASN.1 template, with sample data that couldbe assigned to a working data structure 40 according to the teachingsherein. In particular, the diagram illustrates a hexadecimal byte streamrepresentation of the sample data, such as could be received as anincoming data stream and stored in a root node of a working datastructure 40. For example, the hexadecimal byte stream is received bythe mediation node 10, and it is known by the mediation node 10 that thesample ASN.1 template applies to the received byte stream.

FIG. 8 illustrates the correspondingly instantiated working datastructure 40, which includes Level 0, Level 1 and Level 2 nodes,corresponding to the hierarchy of the encoded data in the received bytestream. Level 0 of the working data structure 40 includes a root node120, which initially holds the byte stream in encoded form. Level 1includes three nodes 122 that are populated as part of path traversal.One sees that each of these three Level-1 nodes 122 corresponds to adifferent data item in the byte stream, at that hierarchical level.Level 2 includes a further three nodes 122 and, again, these furthernodes 122 each correspond to a given data item in the byte stream thatexists at that level of the data hierarchy.

All nodes needed to represent the hierarchical data items of theincoming byte stream may logically exist in terms of the data structuredefinition used to instantiate the working data structure 40. Such anarrangement completely accounts for the hierarchical structure of thereceived byte stream. However, only the nodes 122 corresponding tointervening data items and targeted data items are populated. Moreover,the nodes 122 for intervening data items are populated with encodeddata, and only the nodes 122 for targeted data items are populated withdecoded data.

In the example of FIG. 8, the bottom-right node 122, the one holding the“userID” data item is a “treated data item”—i.e., it is targeted fordata processing. Thus, assuming that userID is the only targeted dataitem, only its corresponding node 122 would hold decoded data.

Assuming that the other illustrated Level 1 and Level 2 nodes wereencountered as intervening nodes in the traversal to the userID dataitem, those nodes would be populated with their respective data itemsstill in encoded form. The intervening and targeted data items will havebeen moved from the root node 120, which saves memory in comparison toleaving them in the root node 120, as well as populating them into thefurther node 122.

The teachings herein are not limited to the ASN.1/BER specification, orto Charging Data Record data types, and instead are applicable toessentially any type of TLV structured data. As compared to conventionencoding and decoding of entire data structures and all included dataitems, the adoption of these teachings for processing such data yieldsend-to-ends performance improvements, significant reductions in memoryutilization, significant reductions in CPU utilization, significantreductions in encoding/decoding “overhead” in distributed processingsystems, and corresponding reductions in the overall hardwarerequirements of data mediation nodes.

Notably, modifications and other embodiments of the disclosedinvention(s) will come to mind to one skilled in the art having thebenefit of the teachings presented in the foregoing descriptions and theassociated drawings. Therefore, it is to be understood that theinvention(s) is/are not to be limited to the specific embodimentsdisclosed and that modifications and other embodiments are intended tobe included within the scope of this disclosure. Although specific termsmay be employed herein, they are used in a generic and descriptive senseonly and not for purposes of limitation.

1-18. (canceled)
 19. A method of processing at a mediation nodeconfigured for data mediation operations in a telecommunication network,the method comprising: receiving an incoming data stream comprisingencoded data items encoded according to a first encoding and arrangedaccording to a defined hierarchical structure; storing the incoming datastream as a stored data stream, said stored data stream stored withoutdecoding at a root node of a working data structure that defines furthernodes corresponding to a plurality of data items encoded in the storeddata stream; identifying a targeted data item in the stored data stream,targeted for data mediation processing; extracting the targeted dataitem based on: traversing the defined hierarchical structure of thestored data stream along a traversal path until reaching the targeteddata item; and for each intervening data item encountered along thetraversal path before reaching the targeted data item, moving, withoutdecoding, the intervening data item from the root node to acorresponding further node in the working data structure; for thetargeted data item, decoding the targeted data item and populating acorresponding further node in the working data structure with thedecoded targeted data item; and providing the working data structure forprocessing of the decoded targeted data item.
 20. The method of claim19, further comprising forming an outgoing data stream by re-encodingthe decoded targeted data item or a corresponding derived data item,after said processing, as a newly-encoded data item, and aggregating thenewly-encoded data item with each intervening data item previously movedto a corresponding further node in the working data structure, andfurther with any remaining data items not moved from the root node, andproviding the outgoing data stream to a targeted recipient.
 21. Themethod of claim 19, wherein identifying the targeted data item comprisesaccessing stored workflow information for a defined processing workflow,wherein the defined processing workflow indicates the targeted dataitem.
 22. The method of claim 21, wherein the defined processingworkflow indicates the targeted data item as one of two or more targeteddata items and wherein the method includes extracting each targeted dataitem and performing said steps of moving and populating for eachtargeted data item, in accordance with the traversal path to eachtargeted data item.
 23. The method of claim 19, wherein the incomingdata stream comprises a byte stream encoded using Type Length Value(TLV) encoding that defines the defined hierarchical structure as a treestructure, and wherein the traversal path extends through as many levelsof the tree structure as are needed to reach the targeted data item. 24.The method of claim 19, wherein the defined hierarchical structurecomprises a tree structure and wherein traversing the definedhierarchical structure comprises beginning at a base level of the treestructure and progressing via a breadth-first traversal to as many nextlevels of the tree structure as needed to reach the targeted data item,such that the breadth-first traversal at each level of the treestructure begins with a first data item and advances through each nextdata item at that level until encountering the targeted data item, inwhich case the traversal ends, or until encountering a container dataitem that is on the traversal path, in which case the traversal advancesto a first contained data item at the next level of the tree structureand restarts the breadth-first traversal at that next level.
 25. Themethod of claim 19, wherein the incoming data stream is an encodedCharging Data Record comprising a plurality of data items associatedwith a chargeable event in the telecommunication network.
 26. The methodof claim 19, wherein the first encoding comprises Abstract SyntaxNotation One (ASN.1) encoding.
 27. A mediation node configured for datamediation operations in a telecommunication network, the mediation nodecomprising: a communication interface configured to receive an incomingdata stream comprising encoded data items encoded according to a firstencoding and arranged according to a defined hierarchical structure; aprocessing circuit operatively associated with the communicationinterface and configured to: store the incoming data stream as a storeddata stream, said stored data stream stored without decoding at a rootnode of a working data structure that defines further nodescorresponding to a plurality of data items encoded in the stored datastream; identify a targeted data item in the stored data stream,targeted for data mediation processing; extract the targeted data itembased on being configured to: traverse the defined hierarchicalstructure of the stored data stream along a traversal path untilreaching the targeted data item; and for each intervening data itemencountered along the traversal path before reaching the targeted dataitem, move, without decoding, the intervening data item from the rootnode to a corresponding further node in the working data structure; forthe targeted data item, decode the targeted data item and populate acorresponding further node in the working data structure with thedecoded targeted data item; and provide the working data structure forprocessing of the decoded targeted data item.
 28. The mediation node ofclaim 27, wherein the processing circuit is further configured to forman outgoing data stream, based on being configured to: re-encode thedecoded targeted data item after said processing, or a correspondingderived data item generated by said processing, as a newly-encoded dataitem; and aggregate the newly-encoded data item with each interveningdata item previously moved to a corresponding further node in theworking data structure, and further with any remaining data items notmoved from the root node, and provide the outgoing data stream to atargeted recipient.
 29. The mediation node of claim 27, wherein theprocessing circuit is configured to identify the targeted data item byaccessing stored workflow information for a defined processing workflow,wherein the defined processing workflow indicates the targeted dataitem.
 30. The mediation node of claim 29, wherein the defined processingworkflow indicates the targeted data item as one of two or more targeteddata items and wherein the processing circuit is configured to extracteach targeted data item and perform said operations of moving andpopulating for each targeted data item, in accordance with the traversalpath to each targeted data item.
 31. The mediation node of claim 27,wherein the incoming data stream comprises a byte stream encoded usingType Length Value (TLV) encoding that defines the defined hierarchicalstructure as a tree structure, and wherein the traversal path extendsthrough as many levels of the tree structure as are needed to reach thetargeted data item.
 32. The mediation node of claim 27, wherein thedefined hierarchical structure comprises a tree structure and whereinthe processing circuit is configured to traverse the definedhierarchical tree structure beginning at a base level of the treestructure and progressing via a breadth-first traversal to as many nextlevels of the tree structure as is needed to reach the targeted dataitem, such that the breadth-first traversal at each level of the treestructure begins with a first data item and advances through each nextdata item at that level until encountering the targeted data item, inwhich case the traversal ends, or until encountering a container dataitem that is on the traversal path, in which case the traversal advancesto a first contained data item at the next level of the tree structureand restarts the breadth-first traversal at that next level.
 33. Themediation node of claim 27, wherein the incoming data stream is anencoded Charging Data Record comprising a plurality of data itemsassociated with a chargeable event in the telecommunication network. 34.The mediation node of claim 27, wherein the first encoding comprisesAbstract Syntax Notation One (ASN.1) encoding.
 35. A mediation nodeconfigured for data mediation operations in a telecommunication network,the mediation node comprising: a first module configured to receive anincoming data stream comprising encoded data items encoded according toa first encoding and arranged according to a defined hierarchicalstructure; a second module configured to store the incoming data streamas a stored data stream, said stored data stream stored without decodingat a root node of a working data structure that defines further nodescorresponding to a plurality of data items encoded in the stored datastream; a third module configured to identify a targeted data item inthe stored data stream, targeted for data mediation processing; a fourthmodule configured to extract the targeted data item based on: traversingthe defined hierarchical structure of the stored data stream along atraversal path until reaching the targeted data item; and for eachintervening data item encountered along the traversal path beforereaching the targeted data item, moving, without decoding, theintervening data item from the root node to a corresponding further nodein the working data structure; for the targeted data item, decoding thetargeted data item and populating a corresponding further node in theworking data structure with the decoded targeted data item; and a fifthmodule configured to provide the working data structure for processingof the decoded targeted data item.